Flat-Combining-Based Persistent Data Structures for Non-volatile Memory

In this work, we present the first persistent (also called durable or recoverable) object implementations that employ flat-combining (FC) synchronization paradigm. Specifically, introduce a detectable FC-based implementation of concurrent LIFO stack, FIFO queue, and double-ended queue. Our empirical evaluation establishes our novel require much smaller number costly persistence instructions than competing algorithms are therefore able to significantly outperform them.